Upper Bounds on the Total Domination Number
نویسندگان
چکیده
A total dominating set of a graph G with no isolated vertex is a set S of vertices of G such that every vertex is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a total dominating set in G. In this paper, we present several upper bounds on the total domination number in terms of the minimum degree, diameter, girth and order.
منابع مشابه
Lower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملOn the edge geodetic and edge geodetic domination numbers of a graph
In this paper, we study both concepts of geodetic dominatingand edge geodetic dominating sets and derive some tight upper bounds onthe edge geodetic and the edge geodetic domination numbers. We also obtainattainable upper bounds on the maximum number of elements in a partitionof a vertex set of a connected graph into geodetic sets, edge geodetic sets,geodetic domin...
متن کاملOn trees attaining an upper bound on the total domination number
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. The total domination number of a graph $G$, denoted by $gamma_t(G)$, is~the minimum cardinality of a total dominating set of $G$. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004), 6...
متن کاملThe probabilistic method for upper bounds in domination theory
Domination is a rapidly developing area of research in graph theory, and its various applications to ad hoc networks, distributed computing, social networks and web graphs partly explain the increased interest. This thesis focuses on domination theory, and the main aim of the study is to apply a probabilistic approach to obtain new upper bounds for various domination parameters. Chapters 2 and ...
متن کاملUpper Bounds for Domination Related Parameters in Graphs on Surfaces
Abstract. In this paper we give tight upper bounds on the total domination number, the weakly connected domination number and the connected domination number of a graph in terms of order and Euler characteristic. We also present upper bounds for the restrained bondage number, the total restrained bondage number and the restricted edge connectivity of graphs in terms of the orientable/nonorienta...
متن کاملMore results on total domination in direct products of graphs
Upper and lower bounds on the total domination number of the direct product of graphs are given. The bounds involve the {2}-total domination number and the total 2-tuple domination number of the factors. Using these relationships some exact total domination numbers are obtained. An infinite family of graphs is constructed showing that the bounds are best possible. The domination number of direc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 91 شماره
صفحات -
تاریخ انتشار 2009